A fixed point operator for the generalised maximum satisfiability problem
نویسندگان
چکیده
منابع مشابه
Strong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms
Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real Hilbert space. So many have used algorithms involving the operator norm for solving split equality fixed point problem, ...
متن کاملA Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem
The Maximum Satisfiability problem (Max-SAT) is one of the most known variants of satisfiability problem. The objective is to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem was showed NP-complete if the number of variable per clause is higher than 3. In this paper we investigate the use of part...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA fixed point for the jump operator on structures
Assuming that 0 exists, we prove that there is a structure that can effectively interpret its own jump. In particular, we get a structure A such that Sp(A) = {x : x ∈ Sp(A)}, where Sp(A) is the set of Turing degrees which compute a copy of A. It turns out that, more interesting than the result itself, is its unexpected complexity. We prove that higher-order arithmetic, which is the union of ful...
متن کاملGirard's $!()$ as a reversible fixed-point operator
We give a categorical description of the treatment of the !() exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation 'forgets types'. We demonstrate that it may be thought of as a fixed-point operation for reversible logic & computation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90024-i